Using CSP To Improve Deterministic 3-SAT
نویسندگان
چکیده
We show how one can use certain deterministic algorithms for higher-value constraint satisfaction problems (CSPs) to speed up deterministic local search for 3SAT. This way, we improve the deterministic worst-case running time for 3-SAT to O(1.439n).
منابع مشابه
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
We give improved deterministic algorithms solving sparse instances of MAX-SAT and MAX-k-CSP. For instances with n variables and cn clauses (constraints), we give algorithms running in time poly(n)· 2n(1−μ) for – μ = Ω( 1 c ) and polynomial space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 √ c ) and exponential space solving MAX-SAT and MAX-kSAT, – μ = Ω( 1 ck2 ) and polynomial space solving MAX-k-...
متن کامل3-Coloring in Time O(1.3289^n)
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a constraint satisfaction (CSP) formulation of these problems. 3-SAT is equivalent to (2, 3)-CSP while the other problems above are special cases of (3, 2)-CSP; there is also a natural duality transformation from (a, b)-CSP to (b, a)-CSP. We ...
متن کاملTabu Search vs. Random Walk
We investigate the beneet of Tabu Search for satissability (SAT) and constraint satisfaction problems (CSP) and compare it to the more frequently used random walk heuristic. We argue, that a more deterministic direction of search as done with Tabu Search is worth considering also for SAT and CSP. We give experimental evidence that Tabu Search can be used to eeciently guide local search procedur...
متن کاملNew Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree
MAX-2-SAT and MAX-2-CSP are important NP-hard optimization problems generalizing many graph problems. Despite many efforts, the only known algorithm (due to Williams) solving them in less than 2 steps uses exponential space. Scott and Sorkin give an algorithm with 2 2 d+1 ) time and polynomial space for these problems, where d is the average variable degree. We improve this bound to O∗(2 10/3 d...
متن کاملUsing CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances
While CNF propositional satisfiability (SAT) is a sub-class of the more general constraint satisfaction problem (CSP), conventional wisdom has it that some well-known CSP look-back techniques -including backjumping and learning -are of little use for SAT. We enhance the Tableau SAT algorithm of Crawford and Auton with look-back techniques and evaluate its performance on problems specifically de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1007.1166 شماره
صفحات -
تاریخ انتشار 2010